Control structures in programs and computational complexity
نویسندگان
چکیده
منابع مشابه
Control structures in programs and computational complexity
This thesis is concerned with analysing the impact of nesting (restricted) control structures in programs, such as primitive recursion or loop statements, on the running time or computational complexity. The method obtained gives insight as to why some nesting of control structures may cause a blow up in computational complexity, while others do not. The method is demonstrated for three types o...
متن کاملThe Garland Measure and Computational Complexity of Stack Programs
A key problem in implicit computational complexity is to analyse the impact on program run times of nesting restricted control structures, such as for-do statements in imperative languages. This problem has two aspects. One is whether there are methods of extracting information from the syntax of such programs that give insight as to why some nesting of control structures may cause a blow up in...
متن کاملAlternation and the Computational Complexity of Logic Programs
D We investigate the complexity of derivations from logic programs, and find it closely related to the complexity of computations of alternating Turing machines. In particular, we define three complexity measures over logic programs-goal-size, length, and depth-and show that goal-size is linearly related to alternating space, the product of length and goal-size is linearly related to alternatin...
متن کاملEvolving Graph-Structures and Their Implicit Computational Complexity
Dynamic data-structures are ubiquitous in programming, and they use extensively underlying directed multi-graph structures, such as labeled trees, DAGs, and objects. This paper adapts well-established static analysis methods, namely data ramification and language-based information flow security, to programs over such graph structures. Our programs support the creation, deletion, and updates of ...
متن کاملMonotonic use of space and computational complexity over abstract structures
We use relational pointer machines as a framework for generalized computational complexity. Non-reuse of memory space, dubbed monotonic computing, is proposed as a fundamental concept that threads together various abstract generalizations of PTime. Depending on the use of space, relational machines generalize DLogSpace, PTime, NPTime and PSpace, We show that alternating first order machines are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2005
ISSN: 0168-0072
DOI: 10.1016/j.apal.2004.10.011